Carl Jockusch

Results: 19



#Item
11Applied mathematics / Computable function / Turing reduction / Reduction / Algorithmically random sequence / Function / Computability theory / Mathematics / Computer science

DIAGONALLY NON-COMPUTABLE FUNCTIONS AND BI-IMMUNITY CARL G. JOCKUSCH, JR. AND ANDREW E.M. LEWIS Abstract. We prove that every diagonally noncomputable function computes a set A which is bi-immune, meaning that neither A

Add to Reading List

Source URL: www.math.uiuc.edu

Language: English - Date: 2013-02-02 15:47:48
12Logic / Theory of computation / Congruence lattice problem / Mathematics / Computability theory / Forcing

RAMSEY’S THEOREM AND CONE AVOIDANCE DAMIR D. DZHAFAROV AND CARL G. JOCKUSCH, JR. Abstract. It was shown by Cholak, Jockusch, and Slaman that every computable 2-coloring of pairs admits an infinite low2 homogeneous set

Add to Reading List

Source URL: www.math.uiuc.edu

Language: English - Date: 2009-07-29 17:59:20
13Mathematics / Computable function / Algorithmically random sequence / Busy beaver / Theory of computation / Computability theory / Applied mathematics

ASYMPTOTIC DENSITY, COMPUTABLE TRACEABILITY, AND 1-RANDOMNESS URI ANDREWS, MINGZHONG CAI, DAVID DIAMONDSTONE, CARL JOCKUSCH, AND STEFFEN LEMPP Abstract. Let r be a real number in the unit interval [0, 1]. A set A ⊆ ω

Add to Reading List

Source URL: www.math.uiuc.edu

Language: English - Date: 2014-02-03 11:22:22
14Year of birth missing / Turing degree / Mathematics / Mathematical logic / Logic / Proof theory / Computability theory / Carl Jockusch / Place of birth missing

ERRATA FOR “ON THE STRENGTH OF RAMSEY’S THEOREM FOR PAIRS” PETER A. CHOLAK, CARL G. JOCKUSCH, JR., AND THEODORE A. SLAMAN Several proofs given in [2] contain significant errors or gaps, although

Add to Reading List

Source URL: www.math.uiuc.edu

Language: English - Date: 2009-08-16 22:19:13
15Mathematics / Jensen hierarchy / Ternary tree / Binary trees / Operator theory

BINARY SUBTREES WITH FEW LABELED PATHS RODNEY G. DOWNEY, NOAM GREENBERG, CARL G. JOCKUSCH, JR., AND KEVIN G. MILANS Abstract. We prove several quantitative Ramseyan results involving ternary complete trees with {0, 1}-la

Add to Reading List

Source URL: www.math.uiuc.edu

Language: English - Date: 2011-07-08 08:35:11
16Mathematics / Theory of computation / PA degree / Computable function / Reverse mathematics / Model theory / Forcing / Combinatory logic / Primitive recursive function / Computability theory / Mathematical logic / Theoretical computer science

THE STRENGTH OF SOME COMBINATORIAL PRINCIPLES RELATED TO RAMSEY’S THEOREM FOR PAIRS DENIS R. HIRSCHFELDT, CARL G. JOCKUSCH, JR., BJØRN KJOS-HANSSEN, STEFFEN LEMPP, AND THEODORE A. SLAMAN Abstract. We study the reverse

Add to Reading List

Source URL: www.math.uiuc.edu

Language: English - Date: 2009-07-29 17:55:43
17Mathematical logic / Theory of computation / Computable function / Halting problem / Turing reduction / Reverse mathematics / Embedding / Ordinal number / Computability theory / Mathematics / Theoretical computer science

On Self-Embeddings of Computable Linear Orderings ? Rodney G. Downey a , Carl Jockusch b and Joseph S. Miller a a School of Mathematical and Computing Sciences

Add to Reading List

Source URL: www.math.uiuc.edu

Language: English - Date: 2009-07-29 17:54:43
18Order theory / Computability theory / Integer sequences / Antichain / Functions and mappings / Computable function / Tree / Function / Model theory / Mathematics / Mathematical logic / Theory of computation

CHAINS AND ANTICHAINS IN PARTIAL ORDERINGS VALENTINA S. HARIZANOV, CARL G. JOCKUSCH, JR., AND JULIA F. KNIGHT Abstract. We study the complexity of infinite chains and antichains in computable partial orderings. We show t

Add to Reading List

Source URL: www.math.uiuc.edu

Language: English - Date: 2009-07-29 17:58:40
19Abstraction / Stable theory / Partially ordered set / Antichain / Ordinal number / Constructible universe / Ultrafilter / Order theory / Mathematics / Structure

STABILITY AND POSETS CARL G. JOCKUSCH, JR., BART KASTERMANS, STEFFEN LEMPP, MANUEL LERMAN, AND REED SOLOMON Abstract. Hirschfeldt and Shore have introduced a notion of stability for infinite posets. We define an arguably

Add to Reading List

Source URL: www.math.uiuc.edu

Language: English - Date: 2009-07-29 18:00:40
UPDATE